package com.pacai.Recursion;

public class Recursion02 {
    public static void main(String[] args) {
        System.out.println(fibonacci(4));
    }
    //斐波那契
    public static int fibonacci(int n){
        if(n <= 2){
            return 1;
        }
        return fibonacci(n - 1) + fibonacci(n - 2);
    }


    public static int peach(int total,int now){
        System.out.println();
        return 1;
    }

}
